|
In mathematics, the T-square is a two-dimensional fractal. As all two-dimensional fractals, it has a boundary of infinite length bounding a finite area. Its name follows from that for a T-square. ==Algorithmic description== It can be generated from using this algorithm: # Image 1: ## Start with a square. (The black square in the image) # Image 2: ## At each convex corner of the previous image, place another square, centered at that corner, with half the side length of the square from the previous image. ## Take the union of the previous image with the collection of smaller squares placed in this way. # Images 3–6: ## Repeat step 2. The method of creation is rather similar to the ones used to create a Koch snowflake or a Sierpinski triangle. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「T-square (fractal)」の詳細全文を読む スポンサード リンク
|